Using Local Spectral Methods to Robustify Graph-Based Learning Algorithms David F. Gleich Computer Science Department Purdue University West Lafayette, IN

Source URL: www.stat.berkeley.edu

• Graph theory
• Mathematics
• NP-complete problems
• Graph partition
• Connectivity
• Graph coloring
• Graph
• Nonlinear dimensionality reduction
• Vertex
• SPQR tree
• Signed graph

The Complete Mixability and Convex Minimization Problems with Monotone Marginal Densities Bin Wang∗ and Ruodu Wang† May 9, 2011 Abstract

Source URL: sas.uwaterloo.ca

• Mathematical analysis
• Statistics
• Probability
• Probability distributions
• Statistical theory
• Binomial distribution
• Distribution
• Expected value
• Completeness

COMPUTING THE PARTITION FUNCTION FOR GRAPH HOMOMORPHISMS WITH MULTIPLICITIES ´n Alexander Barvinok and Pablo Sobero July 2015

Source URL: www.math.lsa.umich.edu

• Graph theory
• Mathematics
• NP-complete problems
• Graph operations
• Graph coloring
• Line graph
• Matching
• Two-graph
• Train track map

Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology Innova

Source URL: nms.citi.sinica.edu.tw

• Mathematics
• Graph theory
• Computational complexity theory
• Combinatorial optimization
• Submodular set function
• Edsger W. Dijkstra
• NP-complete problems
• Algorithm
• Shortest path problem
• HeldKarp algorithm
• Dominating set

First Joint Meeting Brazil Italy of Mathematics Special Session: Algebraic Geometry over Finite Fields and its Applications to Coding Theory Rio de Janeiro, August 29 - September 02, 2016 Title: On a class of Complete Pe

Source URL: www.sbm.org.br

A PARTICLE SWARM OPTIMIZATION HYPER-HEURISTIC FOR THE DYNAMIC VEHICLE ROUTING PROBLEM Michal Okulewicz, Jacek Ma´ ndziuk Faculty of Mathematics and Information Science, Warsaw University of Technology,

Source URL: bioma.ijs.si

• Operations research
• Mathematical optimization
• Mathematics
• Applied mathematics
• Computational complexity theory
• NP-complete problems
• Cybernetics
• Evolutionary algorithms
• Ant colony optimization algorithms
• Particle swarm optimization
• Swarm intelligence
• Hyper-heuristic

Some logical metatheorems with applications in functional analysis Ulrich Kohlenbach∗ BRICS† Department of Computer Science University of Aarhus

Source URL: www.mathematik.tu-darmstadt.de

• Metric geometry
• Space
• Mathematics
• Topology
• Structure
• Topological spaces
• Metric
• Complete metric space
• operator
• Spectral theory of ordinary differential equations

Microsoft PowerPoint - DIALMPOMC03.ppt

Source URL: disco.ethz.ch

• Graph theory
• NP-complete problems
• Wireless networking
• Unit disk graph
• Routing algorithms
• Wireless ad hoc network
• Routing
• Topology control
• Topological graph theory
• Planar graph
• Geographic routing
• Graph coloring

Coproducts and colimits of κ-quantales R. N. Ball and A. Pultr BLAST 6 June 2010

Source URL: spot.colorado.edu

• Algebraic structures
• Category theory
• Order theory
• Semigroup theory
• Limit
• Coproduct
• Cardinal number
• Product
• Complete Heyting algebra
• Quotient group
• Equivalence class
• Monoid

Denitions and construction Topologies on canonical extensions Subspace topologies Canonical extensions of lattices Andrew Craig

Source URL: spot.colorado.edu

• Lattice theory
• Lattice
• Complete lattice
• Dual space
• Distributive lattice
• Topological space
• Congruence lattice problem